A General Modal Framework for the Event Calculus and its Skeptical and Credulous Variants

نویسندگان

  • Angelo Montanari
  • Luca Chittaro
  • Iliano Cervesato
چکیده

We propose a general and uniform modal framework for the Event Calculus (EC) and its skeptical and credolous variants. The resulting temporal formalism, called the Generalized Modal Event Calculus (GMEC), extends considerably the expressive power of EC when information about the ordering of events is incomplete. It provides means of inquiring about the evolution of the maximal validity intervals of properties relatively to all possible refinements of the ordering data by allowing free mixing of propositional connectives and modal operators. We first give a semantic definition of GMEC; then, we propose a declarative encoding of GMEC in the language of hereditary Harrop formulas and state the soundnessand completeness of the resulting logic program.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modal Calculus of Partially

This paper proposes a modal logic reconstruction of temporal reasoning about partially ordered events in a logic programming framework. It considers two variants of Kowalski and Sergot's Event Calculus (EC): the Skeptical EC (SKEC) and the Credulous EC (CREC). In the presence of partially ordered sequences of events, SKEC and CREC derive the maximal validity intervals over which the relevant pr...

متن کامل

Reasoning about Partially Ordered Events in the Event Calculus

The paper deals with the problem of reasoning about partially ordered events in Kowalski and Sergot's Event Calculus (EC). We home in on EC between its skeptical (SKEC) and credulous (CREC) variants. When only partial knowledge about event ordering is given SKEC and CREC compute the set of maximal validity intervals (MVIs) over which the considered properties are necessarily and possibly true, ...

متن کامل

A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in the Event Calculus

In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. ...

متن کامل

Modal Event Calculus in Lolli

This paper introduces two variants of the Event Calculus (EC) with relative timing of events: the Credulous and the Skeptical Event Calculus (CREC and SKEC respectively). A model that takes into account the dynamics of event ordering updates is constructed for EC. In this model, that appears to be a restriction of the usual model for the modal logic S4, CREC and SKEC are proved to be the modal ...

متن کامل

Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events

In this paper, we show how well-known graph-theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot’s Event Calculus and in its skeptical and credulous modal variants. We replace the traditional generate-and-test strategy of basic Event Calculus by a generate-only strategy that operates on the transitive closure and reductio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996